The decidability of equivalence for deterministic stateless pushdown automata
نویسندگان
چکیده
منابع مشابه
Deciding Equivalence of Deterministic Pushdown Automata
Deterministic pushdown automata (DPDA) are a class of simple yet powerful models of computation. It has a finite set of states and a (pushdown) stack. Depending on the current state, the symbol at the top of the stack, and the symbol of the input word that has just been scanned, the automaton moves to a new state, either pushes or pops a symbol on the stack, and it is ready to scan the next sym...
متن کاملThe Equivalence Problem for Deterministic Finite-Turn Pushdown Automata
A deterministic pushdown automaton (dpda) is described as finite-turn if there is a bound on the number of times the direction of the stack movement can change in the set of all derivations from the starting configuration. The purpose of this paper is to show that there exists a procedure for deciding whether two such finite-turn machines recognize the same language. By virtue of a direct corre...
متن کاملDecidability of Bisimulation Equivalence for Pushdown Processes
We show that bisimulation equivalence is decidable for pushdown automata without ǫ-transitions.
متن کاملA Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata
Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the nth level of the hierarchy is over an input alphabet with 2(n−1) elements. In this paper, we improve this result by showing that a binary alphabet is sufficient to establish this hierarchy. As a con...
متن کاملHeight-Deterministic Pushdown Automata
We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on the input are a priori fixed. Different subclasses of height-deterministic pushdown automata, strictly containing the class of regular languages and still closed under boolean language operations, are considered. Several such lan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1978
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(78)90139-0